Planning a path

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Path Planning

While the current part carries the title “path planning” the contributions in this section covers two topics: mapping and planning. In some sense one might argues that intelligent (autonomous) mapping actually requires path planning. While this is correct the contributions actually have a broader scope as is outlined below. A common theme to all of the presentations in this section is the adopt...

متن کامل

A fast path planning by path graph optimization

In this paper, a fast path planning method by optimization of a path graph for both efficiency and accuracy is proposed. A conventional quadtree-based path planning approach is simple, robust, and efficient. However, it has two limitations. The first limitation is that many small cells are required to represent obstacles because the positions and shapes of the cells are not object-dependent and...

متن کامل

Path Relaxation: Path Planning for a Mobile Robot

Path Relaxation is a method of planning safe paths around obstacles for mobile robots. It works in two steps: a global grid starch that finds a rough path, followed by a local relaxation step that adjusts each node on the path to lower the overall path cost. The representation used by Path Relaxation allows an explicit tradeoff among length of path, clearance away from obstacles, and distance t...

متن کامل

Analogical Path Planning

We present a probabilistic method for path planning that considers trajectories constrained by both the environment and an ensemble of restrictions or preferences on preferred motions for a moving robot. Our system learns constraints and preference biases on a robot’s motion from examples, and then synthesizes behaviors that satisfy these constraints. This behavior can encompass motions that sa...

متن کامل

Local Multiresolution Path Planning

Grid-based methods for finding cost optimal paths are popular because of their flexibility and simple implementation. However, their computational complexity becomes unfeasible for real-time path planning if the resolution of the grid is high. These methods assume complete knowledge about the world, but in dynamic environments where sensing is done on board the robot, less is known about far-aw...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Nature Reviews Neuroscience

سال: 2018

ISSN: 1471-003X,1471-0048

DOI: 10.1038/s41583-018-0061-9